Two Machines Flow Shop Scheduling with Single Transport Facility and Job-Block Criteria under Fuzzy Environment
نویسنده
چکیده
This paper pertains to a two machine flowshop scheduling involving independent setup time, transportation time and job block criteria in fuzzy environment. Further, a single transporting agent which carries the jobs from one machine to another is also considered. The objective of the paper is to minimize the makespan, idle time of the machines whenever the processing time, setup time each are under fuzzy environment and are represented by triangular membership function. The scheduling problems with minimization of makespan as one of objective is NP-hard, so exact optimization techniques are impractical. A heuristic algorithm based on some mathematical theorems, to find the optimal sequence of jobs processing with minimum makespan is discussed.
منابع مشابه
Bi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria
Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...
متن کاملNew Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملBi-criteria Scheduling on Parallel Machines Under Fuzzy Processing Time
Job scheduling is concerned with the optimal allocation of scare resources with objective of optimising one or several criteria. Job scheduling has been a fruitful area of research for many decades in which scheduling resolve both allocation of machines and order of processing. If the jobs are scheduled properly, not only the time is saved but also efficiency of system is increased. The paralle...
متن کاملPerformance Measures of Flow Shop Scheduling on Parallel Machines in Fuzzy and Non Fuzzy Environment
In the previous chapter, we have made an analytical study regarding the completion time and the due time of each job, in order to find out the satisfaction level of demand maker in a flow shop scheduling. But this chapter differs in the study that here each job has to process on equi potential parallel machines at first stage and then on other succeeding machines in a specified order. Some addi...
متن کاملElectromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...
متن کامل